combinatorial formula

См. также в других словарях:

• Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… …   Wikipedia

• Combinatorial number system — In mathematics, and in particular in combinatorics, the combinatorial number system of degree k (for some positive integer k), also referred to as combinadics, is a correspondence between natural numbers (taken to include 0) N and k… …   Wikipedia

• Faà di Bruno's formula — is an identity in mathematics generalizing the chain rule to higher derivatives, named in honor of Francesco Faà di Bruno (1825 ndash;1888), who was (in chronological order) a military officer, a mathematician, and a priest, and was beatified by… …   Wikipedia

• Schuette–Nesbitt formula — In probability theory, the Schuette–Nesbitt formula is a generalization of the probabilistic version of the inclusion exclusion principle. It is named after Donald R. Schuette and Cecil J. Nesbitt. The Schuette–Nesbitt formula has practical… …   Wikipedia

• Exponential formula — In combinatorial mathematics, the exponential formula (called the polymer expansion in physics) states that the exponential generating function for structures on finite sets is the exponential of the exponential generating function for connected… …   Wikipedia

• Davidon–Fletcher–Powell formula — The Davidon–Fletcher–Powell formula (or DFP; named after William C. Davidon, Roger Fletcher, and Michael J. D. Powell) finds the solution to the secant equation that is closest to the current estimate and satisfies the curvature condition (see… …   Wikipedia

• Dobinski's formula — In combinatorial mathematics, Dobinski’s formula[1] states that the number of partitions of a set of n members is This number has come to be called the nth Bell number Bn, after Eric Temple Bell. The above formula can be seen as a particular case …   Wikipedia

• Macdonald polynomials — In mathematics, Macdonald polynomials Pλ(x; t,q) are a family of orthogonal polynomials in several variables, introduced by Macdonald (1987). Macdonald originally associated his polynomials with weights λ of finite root systems and used just …   Wikipedia

• Motzkin number — In mathematics, a Motzkin number for a given number n (named after Theodore Motzkin) is the number of different ways of drawing non intersecting chords on a circle between n points. The Motzkin numbers have very diverse applications in geometry,… …   Wikipedia

• Birkhoff polytope — The Birkhoff polytope B n is the convex polytope in R N (where N = n ²) whose points are the doubly stochastic matrices, i.e., the n times; n matrices whose entries are nonnegative real numbers and whose rows and columns each add up to 1.The… …   Wikipedia

• LLT polynomial — In mathematics, an LLT polynomial is one of a family of symmetric functions introduced by Alain Lascoux, Bernard Leclerc, and Jean Yves Thibon (1997) as q analogues of products of Schur functions.J. Haglund, M. Haiman, N. Loehr (2005) showed how… …   Wikipedia